Computation of Partial Automata Through Span Composition
نویسندگان
چکیده
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given and partial automata are constructed from Grp. With a simple categorical operation, computations of partial automata are given and can be seen as a part of the structure of partial automata. Keyworks: computation, partial automata, Category Theory.
منابع مشابه
Computation of Summaries Using Net Unfoldings
We study the following summarization problem: given a parallel composition A = A1 ‖ . . . ‖ An of labelled transition systems communicating with the environment through a distinguished componentAi, efficiently compute a summary Si such that E ‖ A and E ‖ Si are trace-equivalent for every environment E. While Si can be computed using elementary automata theory, the resulting algorithm suffers fr...
متن کاملComposition of Stochastic Transition Systems Based on Spans and Couplings
Conventional approaches for parallel composition of stochastic systems relate probability measures of the individual components in terms of product measures. Such approaches rely on the assumption that components interact stochastically independent, which might be too rigid for modeling real world systems. In this paper, we introduce a parallel-composition operator for stochastic transition sys...
متن کاملA novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective
Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...
متن کاملA novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective
Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...
متن کاملComposing Constraint Automata, State-by-State
The grand composition of n automata may have a number of states/transitions exponential in n. When it does, it seems not unreasonable for the computation of that grand composition to require exponentially many resources (time, space, or both). Conversely, if the grand composition of n automata has a number of states/transitions only linear in n, we may reasonably expect the computation of that ...
متن کامل